import java.util.*;

public class Main {
    static public long func(long n){
        long a=1;
        for(long i=1;i<=n;i++){
            a*=i;
        }
        return a;
    }


    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        long n=scanner.nextLong();
        long sum=func(n);
        for(int i=2;i<sum;i++){

        }

    }
    public static void main3(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int sum=scanner.nextInt();
        for(int i=0;i<sum;i++){
            System.out.println("AC");
        }
    }
    public static void main1(String[] args) {
        Queue<Integer> queue=new LinkedList<>();
        queue.offer(1);

        queue.poll();
        System.out.println(queue.isEmpty());
        }
    public static void main2(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int a=0;
        int sum=scanner.nextInt();
        Queue<Integer> queue=new LinkedList<>();
        Stack<Integer> stack=new Stack<>();
        while (a++<sum){
           // Scanner scanner=new Scanner(System.in);
            int sum1=scanner.nextInt();
            int[] ints1=new int[sum1];


            for(int i=0;i<sum1;i++){
                ints1[i]=scanner.nextInt();
            }
            for(int i=0;i<sum1;i++){
                queue.offer(scanner.nextInt());
            }
            //System.out.println();
            for(int i=0;i<sum1;i++){
                stack.push(ints1[i]);
                while (stack.peek()==queue.peek()){
                    queue.poll();
                    stack.pop();
                    if(stack.isEmpty()) break;
                    if(queue.isEmpty()) break;
                }
                if(queue.isEmpty()) break;
            }
            if(stack.isEmpty()&&queue.isEmpty()){
                System.out.printf("\ntrue");
            }
            else System.out.printf("\nfalse");
            while (!stack.isEmpty()) stack.pop();
            while (!queue.isEmpty()) queue.poll();
        }

    }
}

